A Linear-Processor Algorithm for Depth-First Search in Planar Graphs
نویسنده
چکیده
We present an n-processor and O(lo~n)-time parallel RAM algorithm for finding a depth-first-search tree in an n·vertex planar graph. The algorithm is based on a new n-processor algorithm for finding a cyclic separator in a planar graph and Smith's original parallel depth-first-search algorithm for planar graphs [Smi86].
منابع مشابه
On External-Memory Planar Depth First Search
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no spaceand I/O-efficient algorithms are known for depth-first search or breath-first search in sparse graphs. In this paper, we present two new results on I/O-efficient depth-first search in an important class of sparse graphs, namely undirected emb...
متن کاملA Simple Test for Planar Graphs
Given an undirected graph, the planarity testing problem is to determine whether the graph can be drawn in the plane without any crossing edges. Linear time planarity testing algorithms have previously been designed by Hopcroft and Tarjan, and by Booth and Lueker. However, their approaches are quite involved. We develop a very simple linear time testing algorithm based only on a depth-first sea...
متن کاملPlanar Strong Connectivity
This paper shows that for a strongly connected planar directed graph of size n, a depth-rst search tree rooted a speciied vertex can be computed in O(log 5 n) time using n= logn processors. Previously, for planar directed graphs that may not be strongly connected, the best depth-rst search algorithm runs in O(log 10 n) time using n processors. Both algorithms run on a parallel random access mac...
متن کاملI/O-Efficient Algorithms for Planar Graphs I: Separators∗
We present I/O-efficient algorithms for computing optimal separator partitions of planar graphs. Our main result shows that, given a planar graph G with N vertices and an integer r > 0, a vertex separator of size O (N/√r) that partitions G into O(N/r) subgraphs of size at most r and boundary size O (√r) can be computed in O(sort(N)) I/Os, provided that M ≥ 56r log B. Together with the planar em...
متن کاملPlanar Graph Drawing
This thesis covers three aspects in the field of graph analysis and drawing. Firstly, the depth-first-search–based algorithm for finding triconnected components in general biconnected graphs is presented. This linear-time algorithm was originally published by Hopcroft and Tarjan [17], and corrected by Mutzel and Gutwenger [13]. Since the original paper is hard to understand, the algorithm is pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 29 شماره
صفحات -
تاریخ انتشار 1988